Fuzzy graphs: algebraic structure and syntactic recognition
نویسندگان
چکیده
منابع مشابه
AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
In this paper we extend the notion of degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...
متن کاملan algebraic structure for intuitionistic fuzzy logic
in this paper we extend the notion of degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. it would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. we give the main properties of the operations defined and prove som...
متن کاملA Fuzzy Syntactic Method for On-Line Handwriting Recognition
Fuzzy logic has proved to be a powerful tool to represent imprecise and irregular patterns. Thus the representation of handwriting parameters is accomplished with fuzzy linguistic modeling. The development of a multi-layered rule based handwriting recognition system is described. The selection of the representative features, which describe the shapes and location of segments, is the core of the...
متن کاملAlgebraic Closure of the Fuzzy Graphs using Rough Sets
In 2004, G. Ganesan and C. Raghavendra Rao introduced the concept of Rough Fuzzy Groups. In this paper, we have adapted this approach in defining the algebraic closure of a given fuzzy graph using each vertex.
متن کاملSyntactic Graphs and Constraint Satisfaction
In this paper I will consider parsing as a discrete combinatorial problem which consists in constructing a labeled graph that satisfies a set of linguistic constraints. I will identify some properties of linguistic constraints which allow this problem to be solved efficiently using constraint satisfaction algorithms. I then describe briefly a modular parsing algorithm which constructs a syntact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence Review
سال: 2013
ISSN: 0269-2821,1573-7462
DOI: 10.1007/s10462-013-9412-0